Helicopter search problems, bandwidth and pathwidth
نویسندگان
چکیده
منابع مشابه
Helicopter Search Problems, Bandwidth and Pathwidth
We suggest a uniform game-theoretic approach to " width' graph parameters. We consider a search problem on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the robber. The existence of the winning program for the cop in this problem depends only on the robber's speed. We investigate the problem of finding the minimal robber's speed which prevents the cop from...
متن کاملBandwidth and pathwidth of three-dimensional grids
We study the bandwidth and the pathwidth of multi-dimensional grids. It can be shown for grids, that these two parameters are equal to a more basic graph parameter, the vertex boundary width. Using this fact, we determine the bandwidth and the pathwidth of three-dimensional grids, which were known only for the cubic case. As a by-product, we also determine the two parameters of multi-dimensiona...
متن کاملOnline Problems, Pathwidth, and Persistence
We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bounded width, good online algorithms may exist for a number of natural problems. In the work presented we concentrate on online graph coloring problems, where we restrict the allowed input to instances having some form of bounded ...
متن کاملPathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
We study two related problems motivated by molecular biology: Given a graph G and a constant k, does there exist a supergraph G 0 of G which is a unit interval graph and has clique size at most k? Given a graph G and a proper k-coloring c of G, does there exist a supergraph G 0 of G which is properly colored by c and is a unit interval graph? We show that those problems are polynomial for xed k...
متن کاملFrom Pathwidth to Connected Pathwidth
It is proven that the connected pathwidth of any graph G is at most 2 · pw(G) + 1, where pw(G) is the pathwidth of G. The method is constructive, i.e. it yields an efficient algorithm that for a given path decomposition of width k computes a connected path decomposition of width at most 2k + 1. The running time of the algorithm is O(dk2), where d is the number of ‘bags’ in the input path decomp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00131-5